λ1, Isoperimetric inequalities for graphs, and superconcentrators

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

il,, lsoperimetric Inequalities for Graphs, and Superconcentrators

A general method for obtaining asymptotic isoperimetric inequalities for families of graphs is developed. Some of these inequalities have been applied to functional analysis, This method uses the second smallest eigenvalue of a certain matrix associated with the graph and it is the discrete version of a method used before for Riemannian manifolds. Also some results are obtained on spectra of gr...

متن کامل

Isoperimetric inequalities for minimal graphs

Based on Markvorsen and Palmer work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N × R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. Mathematics Subject Classification: (2000): Primary 53C42; Secondary 53A10

متن کامل

Isoperimetric Inequalities for Cartesian Products of Graphs

We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the cartesian products of graphs.

متن کامل

Percolation on finite graphs and isoperimetric inequalities

Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c > 0, a random subgraph of Gn obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|Gn|, with probability going to one, uniformly in p and the size of the expander. The method from Ajtai, Komlós and Szemerédi [1] ...

متن کامل

Upper bounds for transition probabilities on graphs and isoperimetric inequalities

In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1985

ISSN: 0095-8956

DOI: 10.1016/0095-8956(85)90092-9